1446. Consecutive Characters - LeetCode Solution

class Solution:
    def maxPower(self, s: str) -> int:
        
        count = 1
        
        h = 1
        
        for i in range(len(s) -1) :
            if s[i] == s[i+1]:
                h+=1
            
            else:
                count = max(count, h)
                h = 1
        count = max(count, h)
        return count